Compactness Theorem for Some Generalized Second-Order Language

For the first-order language the compactness theorem was proved by K. Gödel and A. I. Mal’cev in 1936. In 1955, it was proved by J. Łoś (1955) by means of the method of ultraproducts. Unfortunately, for the usual second-order language the compactness theorem does not hold. Moreover, the method of ultraproducts is also inapplicable to second-order models. A possible way out of this situation is to refuse the most vulnerable place in the construction of ultraproducts connected with the factorization relatively an ultrafilter, i.e., to stay working with the ordinary non factorized product. It compels us instead of the single usual set–theoretical equality = to use several generalized equalities ≈first and ≈second for first and second orders, and instead of the single usual set-theoretical belonging ∈ to use several generalized belongings < −second. Following that it is necessary to refuse the usual set-theoretical interpretation (γ(x0), . . . , γ(xk)) ∈ γ(u) of the second basic (after equality) atomic formula (x0, . . . , xk)u and to replace it by the generalized interpretation (γ(x0), . . . , γ(xk))< −τγ(u), where xi i are variables of the first-order types τi, u is a variable of the second-order type τ = [τ0, . . . , τk] (i.e. predicate), and γ is some evaluation of variables on some mathematical system U. This paper is devoted to rigorous development of the expressed general idea. For the generalized in such a manner second-order language the compactness theorem is proved by means of the method of infraproducts consisting in rejection of the Łoś factorization. In the end of the paper the method of infraproducts is applied for the construction of some uncountable models of the second-order generalized Peano–Landau arithmetic.